Edge-ratio network clustering by Variable Neighborhood Search

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search

We consider the generalized minimum edge-biconnected network problem where the nodes of a graph are partitioned into clusters and exactly one node from each cluster is required to be connected in an edge-biconnected way. Instances of this problem appear, for example, in the design of survivable backbone networks. We present different variants of a variable neighborhood search approach that util...

متن کامل

optimization of high-performance concrete structures by variable neighborhood search

this paper describes a methodology in designing high-performance concrete for simply supported beams, using a hybrid optimization strategy based on a variable neighborhood search threshold acceptance algorithm. three strategies have been applied to discrete optimization of reinforced concrete beams: variable neighborhood descent (vnd), reduced neighborhood search (rns) and basic variable neighb...

متن کامل

Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem

The Generalized Minimum Edge Biconnected Network Problem (GMEBCNP) is defined as follows. We consider an undirected weighted graph G = 〈V, E, c〉 with node set V , edge set E, and edge cost function c : E → R. Node set V is partitioned into r pairwise disjoint clusters V1, V2, . . . , Vr, ⋃r i=1 Vi = V, Vi ∩ Vj = ∅ ∀i, j = 1, . . . , r, i 6= j. A solution to the GMEBCNP defined on G is a subgrap...

متن کامل

Iterated variable neighborhood search for the capacitated clustering problem

The NP-hard capacitated clustering problem (CCP) is a general model with a number of relevant applications. This paper proposes a highly effective iterated variable neighborhood search (IVNS) algorithm for solving the problem. IVNS combines an extended variable neighborhood descent method and a randomized shake procedure to explore effectively the search space. The computational results obtaine...

متن کامل

Variable Neighborhood Search Methods

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the Encyclopedia of Optimization.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The European Physical Journal B

سال: 2014

ISSN: 1434-6028,1434-6036

DOI: 10.1140/epjb/e2014-50026-4